Improvement in Evaluation Method on Dial-a-Ride Problem
نویسندگان
چکیده
منابع مشابه
The Dial-A-Ride Problem with Transfers
The Dial–A–Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT invo...
متن کاملThe Integrated Dial-a-Ride Problem
In this paper we present a formulation of the Integrated Dial-a-Ride Problem (IDARP). This problem is to schedule dial-a-ride requests, where some part of each journey may be carried out by a fixed route service. The IDARP is a generalization of the Dial-a-Ride Problem. An arc-based formulation is proposed, and it is shown how the model can be made easier to solve by arc elimination, variable s...
متن کاملThe Finite Capacity Dial-A-Ride Problem
We give the first non-trivial approximation algorithm for the Capacitated Dial-a-Ride problem: given a collection of objects located at points in a metric space, a specified destination point for each object, and a vehicle with a capacity of at most k objects, the goal is to compute a shortest tour for the vehicle in which all objects can be delivered to their destinations while ensuring that t...
متن کاملOn the Online Dial-A-Ride Problem with Time-Windows
In this paper the first results on the Online Dial-A-Ride Problem with Time-Windows (ODARPTW for short) are presented. Requests for rides appearing over time consist of two points in a metric space, a source and a destination. Servers transport objects of requests from sources to destinations. Each request specifies a deadline. If a request is not be served by its deadline, it will be called of...
متن کاملAverage Case Analysis of a Hard Dial-a-Ride Problem
In the dial-a-ride-problem (DARP) objects have to bemoved between given sources and destinations in a trans-portation network by means of a server. The goal is tofind a shortest transportation for the server. We study theDARP when the underlying transportation network formsa caterpillar. This special case is strongly NP-hard in theworst case. We prove that in a probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Industry Applications
سال: 1998
ISSN: 0913-6339,1348-8163
DOI: 10.1541/ieejias.118.1226